On cutting-plane proofs in combinatorial optimization
نویسندگان
چکیده
منابع مشابه
Cutting plane and Frege proofs
The cutting plane refutation system CP for propositional logic is an extension of resolution and is based on showing the non-existence of solutions for families of integer linear inequalities. We deene the system CP + , a modiication of the cutting plane system, and show that CP + can polynomially simulate Frege systems F. In 8], it is shown that F polynomially simulates CP + , so both systems ...
متن کاملCutting-Plane Proofs in Polynomial Space
The integer programming problem is to decide if a given system of linear inequalities has an integral solution. Recent progress on this algorithmic question has involved techniques from the geometry of numbers, in the celebrated paper of Lenstra [20] and in results of Babai [1], Gr6tschel, Lovfisz and Schrijver [14] and Kannan [16]. One of the things that is apparent in these results is the imp...
متن کاملOn Lower Bound Methods for Tree-like Cutting Plane Proofs
In the book Boolean Function Complexity by Stasys Jukna [7], two lower bound techniques for Tree-like Cutting Plane proofs (henceforth, “Tree-CP proofs”) using Karchmer-Widgerson type communication games (henceforth, “KW games”) are presented: The first, applicable to Tree-CP proofs with bounded coefficients, translates Ω(t) deterministic lower bounds on KW games to 2 logn) lower bounds on Tree...
متن کاملOn Mixing Inequalities: Rank, Closure, and Cutting-Plane Proofs
We study the mixing inequalities which were introduced by Günlük and Pochet (2001). We show that a mixing inequality which mixes n MIR inequalities has MIR rank at most n if it is a type I mixing inequality and at most n− 1 if it is a type II mixing inequality. We also show that these bounds are tight for n = 2. Given a mixed-integer set PI = P ∩ Z(I) where P is a polyhedron and Z(I) = {x ∈ Rn ...
متن کاملClique problem, cutting plane proofs and communication complexity
Motivated by its relation to the length of cutting plane proofs for the Maximum Biclique problem, we consider the following communication game on a given graph G, known to both players. Let K be the maximal number of vertices in a complete bipartite subgraph of G, which is not necessarily an induced subgraph if G is not bipartite. Alice gets a set a of vertices, and Bob gets a disjoint set b of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1989
ISSN: 0024-3795
DOI: 10.1016/0024-3795(89)90476-x